public class chess {
	public static void main(String[] args) {
        	String[] pos = new String[15];
		try {
			int i=0;
			//pos = findPosHorse(one,"e4");
			while(pos[i].charAt(0)!='\0') {
				//System.out.print(pos[i++]+" ");
				i++;
			}
		}
		catch(Exception e) {
			
		}
		
		
    }
	static int[] findPosHorse(String one,String curr_pos)
	{
		int[] output_horse = new int[15];
		int[] output_bishop = new int[15];
		int[] output_king = new int[15];
		
		String s1 = "" + curr_pos.charAt(1);
		
                int row,column,i1=curr_pos.charAt(0)-97,j1=Integer.parseInt(s1)-1,i,j;
		int horse=0,bishop=0,king=0;
		System.out.println("i = " + i1);
		for(i=0;i<8;i++) {
			int diff_i = diff(i,i1);
			for(j=0;j<8;j++) {
				/* FOR HORSE */
				int diff_j = diff(j,j1);
				if((diff_i==1 && diff_j==2) || (diff_i==2 && diff_j==1))  {
					int op = (int)(i+j);
					output_horse[horse++]=op;
				}
				/* FOR BISHOP */
				if(diff_i==diff_j && i!=i1 && j!=j1) {
					String op1 = (char)(i+97)+""+(j+1);
					System.out.println(""+(char)(i+97)+""+(j+1));
		//			output_bishop[bishop++] = op1;
				}
				/* FOR KING */
				if((diff_i==0 && diff_j==1) || (diff_i==1 && diff_j==0) || (diff_i==1 && diff_j==1)) {
					//System.out.println((char)(i+97)+""+(j+1));
					String op3 = (char)(i+97)+""+(j+1);
		//			output_king[king++] = op3;
				}
				/* FOR PAWN */
				if((diff_i==1 && diff_j==1 && i1>i) || (diff_i==1 && diff_j==0 && i1>i)) {
					//System.out.println((char)(i+97)+""+(j+1));
					String op4 = (char)(i+97)+""+(j+1);
					//output_king[king++] = op3;
				}
			}
		}
                for(i=0;i<6;i++) {
                    //i1,j1;
                //    output_horse[i] =
                }
                return output_horse;
		//return output_horse;
	}
	//static String[] findPos
	static int diff(int a,int b)
	{
		if(a>b) return (a-b);
		else return (b-a);
	}				
}